Decomposing subcubic graphs into claws, paths or triangles
نویسندگان
چکیده
Let S = { K 1 , 3 P 4 } be the set of connected graphs size 3. We study problem partitioning edge a graph G into taken from any nonempty ′ ⊆ S. The is known to NP-complete for possible choice in general graphs. In this paper, we assume that input subcubic (i.e., all its vertices have degree at most 3), and computational complexity ′. identify polynomial problems setting.
منابع مشابه
Decomposing Graphs into Long Paths
It is known that the edge set of a 2-edge-connected 3-regular graph can be decomposed into paths of length 3. W. Li asked whether the edge set of every 2-edge-connected graph can be decomposed into paths of length at least 3. The graphs C3, C4, C5, and K4 − e have no such decompositions. We construct an infinite sequence {Fi}∞i=0 of nondecomposable graphs. On the other hand, we prove that every...
متن کاملDecomposing series-parallel graphs into paths of length 3 and triangles
An old conjecture by Jünger, Reinelt and Pulleyblank states that every 2-edgeconnected planar graph can be decomposed into paths of length 3 and triangles, provided its size is divisible by 3. We prove the conjecture for a class of planar graphs including all 2-edge-connected series-parallel graphs. We also present a 2edge-connected non-planar graph that can be embedded on the torus and admits ...
متن کاملDecomposing block-intersection graphs of Steiner triple systems into triangles
The problem of decomposing the block intersection graph of a Steiner triple system into triangles is considered. In the case when the block intersection graph has even degree, this is completely solved, while when the block intersection graph has odd degree, removal of some spanning subgraph of odd degree is necessary before the rest can be decomposed into triangles. In this case, some decompos...
متن کاملDecomposing 8-regular graphs into paths of length 4
A T -decomposition of a graph G is a set of edge-disjoint copies of T in G that cover the edge set of G. Graham and Häggkvist (1989) conjectured that any 2l-regular graph G admits a T -decomposition if T is a tree with l edges. Kouider and Lonc (1999) conjectured that, in the special case where T is the path with l edges, G admits a T -decomposition D where every vertex of G is the end-vertex o...
متن کاملDecomposing Highly Connected Graphs into Paths of Length Five
Barát and Thomassen (2006) posed the following decomposition conjecture: for each tree T , there exists a natural number kT such that, if G is a kT -edge-connected graph and |E(G)| is divisible by |E(T )|, then G admits a decomposition into copies of T . In a series of papers, Thomassen verified this conjecture for stars, some bistars, paths of length 3, and paths whose length is a power of 2. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 2021
ISSN: ['0364-9024', '1097-0118']
DOI: https://doi.org/10.1002/jgt.22713